منابع مشابه
Cellular Automata on the Micron Automata Processor
A cellular automaton (CA) is a well-studied and widely used time-evolving discrete model. CAs are studied in many fields of science, such as computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling. Some CA models have been proven to be Turing Complete, such as the elementary cellular automaton (ECA) of Rule-110 and Conways Game of Life. Mi...
متن کاملinstalls massively parallel processor
A massively parallel processor, containing 16,384 processors in an SIMD (single-instruction, multiple-data) configuration, was installed at NASA Goddard Space Flight Center in May 1983, reported Paul B. Schneck in a paper presented to the International Conference on Computer Design at Port Chester, New York, November 1. The large size of this array processor is made necessary by the enormous da...
متن کاملProcessor Efficient Parallel Solution
Nous pr esentons un algorithme parall ele d eterministe pour la r esolution d'un syst eme d' equations lin eaires Ax = b sur un corps de caract eristique nulle. Cet algorithme s'ex ecute en temps O(log 2 n) et utilise O(M(n)) processeurs arithm etiques si M(n) est le nombre de processeurs requis pour le produit de matrices en temps O(log n). Abstract. We present a deterministic parallel algorit...
متن کاملThe HEP Parallel Processor
A lthough there is an abundance of concepts for parallel computing, there is a dearth of experimental data delineating their strengths and weaknesses. Consequently, for the past three years personnel in the Laboratory’s Computing Division have been conducting experiments on a few parallel computing systems. The data thus far are uniformly positive in supporting the idea that parallel processing...
متن کاملScheduling Tasks of a Parallel Program in Two-Processor Systems with Use of Cellular Automata
Cellular automata (CA) are proposed to design scheduling algorithms for allocating tasks of a parallel program in multiprocessor systems. For this purpose a program graph is considered as CA which control a process of migration of tasks in a multiprocessor system. In the rst phase of the algorithm, e ective rules for CA are discovered by a genetic algorithm. In the second phase, for any initial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGARCH Computer Architecture News
سال: 2017
ISSN: 0163-5964
DOI: 10.1145/3140659.3080207